A Model of Forming a Simple Path in a Level of a Complete K-ary Tree Maximizing Total Shortening Path Length
نویسنده
چکیده
This study proposes a model of adding edges of forming a simple path to a level of depth N in a complete K-ary (K ≥ 3) tree of height H under giving priority to edges between two nodes of which the deepest common ancestor is deeper. An optimal depth N∗ is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes in the complete K-ary tree.
منابع مشابه
Adding Edges for a Simple Path to a Level of a Complete Binary Tree Maximizing Total Shortening Path Length
This study proposes a model of adding edges of forming a simple path to a level of depth N in a complete binary tree of height H under giving priority to edges between two nodes of which the deepest common ancestor is deeper. An optimal depth N∗ is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes in ...
متن کاملAdding Edges for a Simple Cycle to a Complete Binary Tree Maximizing Total Shortening Path Length
Abstract—This study proposes a model of adding edges of forming a simple cycle to a level of depth N in a complete binary tree of height H under giving priority to edges between two nodes of which the deepest common ancestor is deeper. An optimal depth N* is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all...
متن کاملAdding an Edge between the Root and a Node of a Complete K-ary Linking Pin Structure Maximizing Total Shortening Distance
This study considers the addition of relation to an organization structure such that the communication of information between every member in the organization becomes the most efficient. This paper proposes a model of adding relation to a complete K-ary linking pin structure where every pair of siblings in a complete K-ary tree is adjacent. For a model of adding an edge between the root and a n...
متن کاملAdding an Edge between a Node and its Descendant of a Complete K-ary Linking Pin Structure Maximizing Total Shortening Distance
Abstract—This paper proposes a model of adding relation to a linking pin organization structure where every pair of siblings in a complete K-ary tree of height H is adjacent such that the communication of information in the organization becomes the most efficient. For a model of adding an edge between a node with a depth M and its descendant with a depth N, we formulated the total shortening di...
متن کاملAdding Edges between One Node and Every Other Node with the Same Depth in a Complete K-ary Tree
This paper proposes a model of adding relations between members of the same level in a pyramid organization structure which is a complete K-ary tree such that the communication of information between every member in the organization becomes the most efficient. When edges between one node and every other node with the same depth N in a complete K-ary tree of height H are added, an optimal depth ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010